Prime-valent symmetric graphs with a quasi-semiregular automorphism

نویسندگان

چکیده

An automorphism of a graph is called quasi-semiregular if it fixes unique vertex the and its remaining cycles have same length. This kind symmetry graphs was first investigated by Kutnar, Malnič, Martínez Marušič in 2013, as generalization well-known problem regarding existence semiregular automorphisms vertex-transitive graphs. Symmetric valency three or four, admitting automorphism, been classified recent two papers (Feng et al., 2019 [11]) (Yin Feng, 2021 [42]). Let Γ be connected symmetric prime p≥5 automorphism. In this paper, proved that either Cayley Cay(M,S) such M 2-group fixed-point-free order p with S an orbit involutions, normal N-cover T-arc-transitive where T non-abelian simple group N nilpotent group. Further, for p=5 complete classification Aut(Γ) has solvable arc-transitive subgroup given. Finally, construction infinite family having nonsolvable

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arc-transitive graphs of valency 8 have a semiregular automorphism∗

One version of the polycirculant conjecture states that every vertex-transitive graph has a non-identity semiregular automorphism that is, a non-identity automorphism whose cycles all have the same length. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open valency.

متن کامل

All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism

The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...

متن کامل

On minimal symmetric automorphism groups of finite symmetric graphs

Let r be finite connected and G a group of automorphisms of r which is transitive on vertices. Suppose that, for a vertex 0 of r, S ~ G~(O') ::; Aut S for some simple group S with S acting primitively on the set r( a) of neighbours of 0, and suppose that G is minimal with these properties. Then one of: (i) G is a nonabelian simple group, (ii) r is a Cayley graph for a normal subgroup N of G and...

متن کامل

Distance Transitive Graphs with Symmetric or Alternating Automorphism Group

for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...

متن کامل

Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group

A graph is said to be 1 2-transitive if its automorphism group is ver-tex and edge but not arc-transitive. For each n 11, a 1 2-transitive graph of valency 4 and girth 6, with the automorphism group isomor-phic to A n Z 2 , is given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2023

ISSN: ['0095-8956', '1096-0902']

DOI: https://doi.org/10.1016/j.jctb.2022.12.001